Minimization and Partitioning Method Reducing Input Sets

نویسندگان

  • Jan Hlavicka
  • Petr Fiser
چکیده

The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the restrictions stated for the number of inputs and outputs of individual components and/or with the goal to reach load balancing for the inputs. The method can handle extremely large functions (up to thousands of input variables) in a very short time and its use is advantageous above all for highly unspecified functions, where the number of don't cares is large.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flexible Minimization and Partitioning Method

The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimizer. The minimization is performed with respect to various restrictions stated for the use of input variables. This enables us to effectively decompose the circuit into several components for which the numbers of inputs and outputs are explicitly specified. The method can thus be used t...

متن کامل

cHawk: An Efficient Biclustering Algorithm based on Bipartite Graph Crossing Minimization

Biclustering is a very useful data mining technique for gene expression analysis and profiling. It helps identify patterns where different genes are co-related based on a subset of conditions. Bipartite Spectral partitioning is a powerful technique to achieve biclustering but its computation complexity is prohibitive for applications dealing with large input data. We provide a connection betwee...

متن کامل

Constructing accurate and parsimonious fuzzy models with distinguishable fuzzy sets based on an entropy measure

Parsimony is very important in system modeling as it is closely related to model interpretability. In this paper, a scheme for constructing accurate and parsimonious fuzzy models by generating distinguishable fuzzy sets is proposed, in which the distinguishability of input space partitioning is measured by a so-called “local” entropy. By maximizing this entropy measure the optimal number of mer...

متن کامل

Reducing Collisions between Bluetooth Piconets by Orthogonal Hop Set Partitioning

Abshacl This paper proposes , B novel orthogonal hop set partitioning (OHSP) scheme aimed at reducing the collisions between piconets at the hop level, by pariitioning the original Bluetooth hop band into five orthogonal sub-hop sets. To support OHSP, an orthogonal hop sets construction method and enhanced synthesizer structure are presented. In each piconet, the master randomly and independent...

متن کامل

A Minimization Approach to Membership Evaluation in Fuzzy Sets and Error Analysis

Evaluation of the degree of membership in fuzzy sets is a fundamental topic in fuzzy set theory. Saaty (Ref. 1) proposes a method for solving this problem that has been widely accepted. In this paper we examine the problem from an error minimization point of view that attempts to reflect the real intentions of the decision maker. When this approach is used, the findings reveal that fuzzy sets o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002